Comparable Characterizations of Four Solutions for Permission Tree Games

Comparable Characterizations of Four Solutions for Permission Tree Games

In the field of cooperative games there is an extensive literature that studies situations of restricted cooperation. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson value of such a game is obtained by taking the Shapley value of the corresponding restrict...

The Average Tree Permission Value for Games with a Permission Tree

In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we consider such sets of feasible coalitions that follow from a permission structure on the set of players...

Characterizations of solutions for games with precedence constraints

We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under strategic equivalence, closedness (CLOS), the reduced game property (RGP), the reconfirmation property (RCP) for suitably generalized Davis-Maschler reduced games,...

Average tree solutions for graph games

In this paper we consider cooperative graph games being TU-games in which players cooperate if they are connected in the communication graph. We focus our attention to the average tree solutions introduced by Herings, van der Laan and Talman [6] and Herings, van der Laan, Talman and Yang [7]. Each average tree solution is defined with respect to a set, say T , of admissible rooted spanning tree...

Decidable Characterizations for Tree Logics